Quantum Spins and Random Loops on the Complete Graph

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Random Graph Ensembles with Many Short Loops

Networks observed in the real world often have many short loops. This violates the treelike assumption that underpins the majority of random graph models and most of the methods used for their analysis. In this paper we sketch possible research routes to be explored in order to make progress on networks with many short loops, involving old and new random graph models and ideas for novel mathema...

متن کامل

The Random-cluster Model on the Complete Graph

Béla Bollobás, Geoffrey Grimmett, Svante Janson Abstract. The random-cluster model of Fortuin and Kasteleyn contains as special cases the percolation, Ising, and Potts models of statistical physics. When the underlying graph is the complete graph on n vertices, then the associated processes are called ‘mean-field’. In this study of the mean-field random-cluster with parameters p = λ/n and q, we...

متن کامل

On the Complete Convergence ofWeighted Sums for Dependent Random Variables

We study the limiting behavior of weighted sums for negatively associated (NA) random variables. We extend results in Wu (1999) and a theorem in Chow and Lai (1973) for NA random variables.

متن کامل

Two particles ’ repelling random walks on the complete graph

We consider two particles’ repelling random walks on complete graphs. In this model, each particle has higher probability to visit the vertices which have been seldom visited by the other one. By a dynamical approach we prove that the two particles’ occupation measure asymptotically has small joint support almost surely if the repulsion is strong enough.

متن کامل

Nim On The Complete Graph

The two-player game of Nim on graphs is played on a regular graph with positively weighted edges by moving alternately from a fixed starting vertex to an adjacent vertex, decreasing the weight of the incident edge to a strictly smaller non-negative integer. The game ends when a player is unable to move since all edges incident with the vertex from which the player is to move have weight zero. I...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Communications in Mathematical Physics

سال: 2019

ISSN: 0010-3616,1432-0916

DOI: 10.1007/s00220-019-03634-x